/**
 * @author VernHe
 * @date 2021年05月13日 14:13
 */
public class Solution_064 {
    public static void main(String[] args) {
        new Solution_064().minPathSum(new int[][]{
                {1, 2, 3},
                {4, 5, 6},
        });
    }

    public int minPathSum1(int[][] grid) {
        int res = 0;
        int m = grid.length;
        int n = grid[0].length;
        if (grid == null || m == 0 || n == 0) {
            return res;
        }

        int[][] dp = new int[m][n];
        dp[0][0] = grid[0][0];
        // 初始化第一行和第一列
        for (int i = 1; i < n; i++) {
            dp[0][i] = grid[0][i] + dp[0][i-1];
        }
        for (int i = 1; i < m; i++) {
            dp[i][0] = grid[i][0] + dp[i-1][0];
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = Math.min(dp[i-1][j] + grid[i][j],dp[i][j-1] + grid[i][j]);
            }
        }
        return dp[m-1][n-1];
    }

    public int minPathSum(int[][] grid) {
        int res = 0;
        int m = grid.length;
        int n = grid[0].length;
        if (grid == null || m == 0 || n == 0) {
            return res;
        }

        int[] dp = new int[n];
        dp[0] = grid[0][0];
        // 初始化第一行
        for (int i = 1; i < n; i++) {
            dp[i] = grid[0][i] + dp[i-1];
        }
        for (int a : dp) {
            System.out.printf(a + " ");
        }
        System.out.println();
        int val = 0;
        for (int i = 1; i < m; i++) {
            for (int j = 0; j < n; j++) {
                val = grid[i][j];
                dp[j] = j == 0 ? dp[j] + val : Math.min(dp[j-1] + val, dp[j] +val);
            }
            System.out.println("-----------------");
            for (int a : dp) {
                System.out.printf(a + " ");
            }
            System.out.println();
        }
        return dp[n-1];
    }
}
